Random Graph Asymptotics on High-Dimensional Tori
نویسندگان
چکیده
منابع مشابه
Random graph asymptotics on high-dimensional tori
We investigate the scaling of the largest critical percolation cluster on a large d-dimensional torus, for nearest-neighbor percolation in high dimensions, or when d > 6 for sufficient spread-out percolation. We use a relatively simple coupling argument to show that this largest critical cluster is, with high probability, bounded above by a large constant times V 2/3 and below by a small consta...
متن کاملRandom graph asymptotics on high-dimensional tori II. Volume, diameter and mixing time
For critical (bond-) percolation on general high-dimensional torus, this paper answers the following questions: What is the diameter of the largest cluster? What is the mixing time of simple random walk on the largest cluster? The answer is the same as for critical Erdős-Rényi random graphs, and extends earlier results by Nachmias and Peres [35] in this setting. We further improve our bound on ...
متن کاملAsymptotics for Sparse Exponential Random Graph Models
We study the asymptotics for sparse exponential random graph models where the parameters may depend on the number of vertices of the graph. We obtain a variational principle for the limiting free energy, an associated concentration of measure, the asymptotics for the mean and variance of the limiting probability distribution, and phase transitions in the edge-triangle model. Similar analysis is...
متن کاملPoisson asymptotics for random projections of points on a high-dimensional sphere
Project a collection of points on the high-dimensional sphere onto a random direction. If most of the points are sufficiently far from one another in an appropriate sense, the projection is locally close in distribution to the Poisson point process.
متن کاملPractical Cryptography in High Dimensional Tori
At Crypto 2004, van Dijk and Woodruff introduced a new way of using the algebraic tori Tn in cryptography, and obtained an asymptotically optimal n/φ(n) savings in bandwidth and storage for a number of cryptographic applications. However, the computational requirements of compression and decompression in their scheme were impractical, and it was left open to reduce them to a practical level. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 2006
ISSN: 0010-3616,1432-0916
DOI: 10.1007/s00220-006-0152-8